منابع مشابه
Constrained derivative-free optimization on thin domains
Many derivative-free methods for constrained problems are not efficient for minimizing functions on “thin” domains. Other algorithms, like those based on Augmented Lagrangians, deal with thin constraints using penalty-like strategies. When the constraints are computationally inexpensive but highly nonlinear, these methods spend many potentially expensive objective function evaluations motivated...
متن کاملObjective-derivative-free methods for constrained optimization
We propose feasible descent methods for constrained minimization that do not make explicit use of objective derivative information. The methods at each iteration sample the objective function value along a finite set of feasible search arcs and decrease the sampling stepsize if an improved objective function value is not sampled. The search arcs are obtained by projecting search direction rays ...
متن کاملAn Efficient Modified Derivative-Free Method on Bound Constrained Optimization
This paper introduces an efficient modified derivative-free method for bound constrained optimization problems. It is based on the coordinate search method. During the running of the algorithm, it incorporates the progressive obtained local information into the current iteration. Actually, after we find two different suitable descent directions, we introduce the composite expansion step. By doi...
متن کاملConstrained Production Optimization with an Emphasis on Derivative-free Methods
Production optimization involves the determination of optimum well controls to maximize an objective function such as cumulative oil production or net present value. In practice, this problem additionally requires the satisfaction of physical and economic constraints. Thus the overall problem represents a challenging nonlinearly constrained optimization. This work entails a comparative study of...
متن کاملSequential Penalty Derivative-Free Methods for Nonlinear Constrained Optimization
We consider the problem of minimizing a continuously differentiable function of several variables subject to smooth nonlinear constraints. We assume that the first order derivatives of the objective function and of the constraints can be neither calculated nor approximated explicitly. Hence, every minimization procedure must use only a suitable sampling of the problem functions. These problems ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Global Optimization
سال: 2012
ISSN: 0925-5001,1573-2916
DOI: 10.1007/s10898-012-9944-x